A Tunable Real-world Multi-funnel Benchmark Problem for Evolutionary Optimization - And Why Parallel Island Models Might Remedy the Failure of CMA-ES on It

نویسندگان

  • Christian L. Müller
  • Ivo F. Sbalzarini
چکیده

A common shortcoming in the Evolutionary Computation (EC) community is that the publication of many search heuristics is not accompanied by rigorous benchmarks on a balanced set of test problems. A welcome effort to promote such test suites are the IEEE CEC competitions on real-valued black-box optimization. These competitions prescribe carefully designed synthetic test functions and benchmarking protocols. They do, however, not contain tunable real-world examples of the important class of multi-funnel functions. We argue that finding minimum-energy configurations of 38-atom Lennard-Jones (LJ38) clusters could serve as such a benchmark for real-valued, single-objective evolutionary optimization. We thus suggest that this problem be included in EC studies whenever general-purpose optimizers are proposed. The problem is tunable from a single-funnel to a double-funnel topology. We show that the winner of the CEC 2005 competition, the Evolution Strategy with Covariance Matrix Adaptation (CMA-ES), works on the single-funnel version of this test case, but fails on the double-funnel version. We further argue that this performance loss of CMA-ES can be relaxed by using parallel island models. We support this hypothesis by simulation results of a parallel island CMA-ES, the Particle Swarm CMA-ES, on a subset of the multi-funnel functions in the CEC 2005

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Evolutionary Algorithm Based on a Hybrid Multi-Attribute Decision Making Method for the Multi-Mode Multi-Skilled Resource-constrained Project Scheduling Problem

This paper addresses the multi-mode multi-skilled resource-constrained project scheduling problem. Activities of real world projects often require more than one skill to be accomplished. Besides, in many real-world situations, the resources are multi-skilled workforces. In presence of multi-skilled resources, it is required to determine the combination of workforces assigned to each activity. H...

متن کامل

A parallel multi-objective optimization algorithm for the calibration of mathematical models

Based on evolutionary computation techniques, we present a parallel, globally convergent, multiobjective optimization algorithm which extends the Covariance Matrix Adaptation Evolutionary Strategy (CMA-ES). This approach enables identifying multiple global optima and multiple discontinuous Pareto set solutions of the optimization problem in a compact search space. After evaluating the algorithm...

متن کامل

Human-competitive lens system design with evolution strategies

Lens system design provides ideal problems for evolutionary algorithms: a complex nonlinear optimization task, often with intricate physical constraints, for which there is no analytical solutions. This paper demonstrates, through the use of two evolution strategies, namely non-isotropic SA-ES and CMA-ES, as well as multiobjective NSGA-II optimization, the human competitiveness of an approach w...

متن کامل

A multi-tier adaptive grid algorithm for the evolutionary multi-objective optimisation of complex problems

The multi-tier Covariance Matrix Adaptation Pareto Archived Evolution Strategy (m-CMA-PAES) is an evolutionary multi-objective optimisation (EMO) algorithm for real-valued optimisation problems. It combines a nonelitist adaptive grid based selection scheme with the efficient strategy parameter adaptation of the elitist CovarianceMatrix Adaptation Evolution Strategy (CMA-ES). In the original CMA...

متن کامل

Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009